Evolutionary Monte Carlo Methods for Clustering

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Monte Carlo Methods for Clustering

The problem of clustering a group of observations according to some objective function (e.g., K -means clustering, variable selection) or a density (e.g., posterior from a Dirichlet process mixture model prior) can be cast in the framework of Monte Carlo sampling for cluster indicators. We propose a new method called the evolutionary Monte Carlo clustering (EMCC) algorithm, in which three new “...

متن کامل

Discrete range clustering using Monte Carlo methods

Quick Release-This Technical Memoi'andum is an unedited report. It is being released in this format to quickly provide the research community with important information.

متن کامل

Monte Carlo and quasi-Monte Carlo methods

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N~^), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Ca...

متن کامل

Monte-Carlo and Quasi-Monte-Carlo Methods for Numerical Integration

We consider the problem of numerical integration in dimension s, with eventually large s; the usual rules need a very huge number of nodes with increasing dimension to obtain some accuracy, say an error bound less than 10−2; this phenomenon is called ”the curse of dimensionality”; to overcome it, two kind of methods have been developped: the so-called Monte-Carlo and Quasi-Monte-Carlo methods. ...

متن کامل

On learning strategies for evolutionary Monte Carlo

The real-parameter evolutionary Monte Carlo algorithm (EMC) has been proposed as an effective tool both for sampling from high-dimensional distributions and for stochastic optimization (Liang and Wong, 2001). EMC uses a temperature ladder similar to that in parallel tempering (PT; Geyer, 1991). In contrast with PT, EMC allows for crossover moves between parallel and tempered MCMC chains. In the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2007

ISSN: 1061-8600,1537-2715

DOI: 10.1198/106186007x255072